Randomized oblivious integral routing for minimizing power cost
نویسندگان
چکیده
منابع مشابه
Randomized oblivious integral routing for minimizing power cost
Article history: Received 13 November 2014 Received in revised form 6 June 2015 Accepted 4 July 2015 Available online 9 July 2015
متن کاملMinimizing Average Spraying Cost for Routing in Delay Tolerant Networks
In this paper, we study cost efficient multi-copy spraying algorithm for routing in Delay Tolerant Networks (DTN) in which source-to-destination path does not exist most of the time. We present a novel idea and the corresponding algorithm for achieving the average minimum cost of packet transmission while maintaining the desired delivery rate by the given deadline. The number of message copies ...
متن کاملTraffic Oblivious Routing
The objective of the book is to describe recent developments in oblivious routing. There are two broad methodologies for routing network traffic in an oblivious manner without detailed knowledge of the traffic matrix. Both these approaches will be covered in the book. The first is Direct Routing which routes packets along fixed paths, from ingress to egress, that are picked to optimize some obj...
متن کامل3 Oblivious Routing Schemes
where P̂ is a linear projection onto the space of circulations, i.e., of all the flows f with Bf = 0, and ĥ is some fixed unit s-t flow. As we showed last time, once we construct a projection P (·) then we obtain an (1 − ε)-approximate maximum flow algorithm whose performance is described in the following theorem. Theorem 1 If P (·) is an α-approximate affine `∞-projection P (·) onto the space F...
متن کاملMinimizing congestion in General Networks using oblivious on-line routing algorithms
A priciple task in parallel and distributed systems, such as networks of workstation or the Internet, is to reduce the communication load in the interconnection network, for the bandwidth of the connection network is usually the major bottleneck for the performance of distributed applications. This is due to the fact that it is often more expensive or more difficult to increase the bandwidth of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.07.007